Description

It is a multi-threaded distributed file system that leverages the underlying operating system's filesystem for fundamental operations like file and directory management, reading, writing, deleting, and renaming. It boasts advanced features such as fault tolerance and distributed storage. Drawing inspiration from Google File System (GFS), its architecture comprises master and slave servers, with a central server overseeing data storage across multiple storage servers. To ensure synchronization between storage servers and the central server, the Berkeley Algorithm is employed. This algorithm involves the central server polling storage servers for their time, calculating the average time difference, and adjusting the central server's time accordingly. The corrected time is then used to compute time corrections for each storage server, which are subsequently communicated to the respective servers.